An Efficient Electro-Ultrafilter
نویسندگان
چکیده
منابع مشابه
An Ultrafilter Approach to Jin’s Theorem
It is well known and not difficult to prove that if C ⊆ Z has positive upper Banach density, the set of differences C −C is syndetic, i.e. the length of gaps is uniformly bounded. More surprisingly, Renling Jin showed that whenever A and B have positive upper Banach density, then A − B is piecewise syndetic. Jin’s result follows trivially from the first statement provided that B has large inter...
متن کاملIbuprofen Removal from a Pharmaceutical Wastewater using Electro-Fenton Process: An Efficient Technique (RESEARCH NOTE)
The aim of this research was to evaluate the effective parameters such as pH, current density (mA/cm2), H2O2/Fe2+ molar ratio, volume ratio of H2O2 to pharmaceutical wastewater (PhW) (ml/l) and reaction time (min) on the electro-Fenton process for the ibuprofen (as a pharmaceutical waste in water) removal. Since a synthetic wastewater with the same concentration of ibuprofen in a real pharmaceu...
متن کاملEfficient microwave to optical photon conversion: an electro-optical realization
ALFREDO RUEDA, FLORIAN SEDLMEIR, MICHELE C. COLLODO, ULRICH VOGL, BIRGIT STILLER, GERHARD SCHUNK, DMITRY V. STREKALOV, CHRISTOPH MARQUARDT, JOHANNES M. FINK, OSKAR PAINTER, GERD LEUCHS, AND HARALD G. L. SCHWEFEL* Max Planck Institute for the Science of Light, Günther-Scharowsky-Straße 1/Building 24, 90158 Erlangen, Germany Institute for Optics, Information and Photonics, University Erlangen-Nür...
متن کاملUltrafilter Extensions for Coalgebras
This paper studies finitary modal logics as specification languages for Set-coalgebras (coalgebras on the category of sets) using Stone duality. It is wellknown that Set-coalgebras are not semantically adequate for finitary modal logics in the sense that bisimilarity does not in general coincide with logical equivalence. Stone-coalgebras (coalgebras over the category of Stone spaces), on the ot...
متن کاملHindman's theorem: an ultrafilter argument in second order arithmetic
Hindman’s Theorem is a prototypical example of a combinatorial theorem with a proof that uses the topology of the ultrafilters. We show how the methods of this proof, including topological arguments about ultrafilters, can be translated into second order arithmetic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Microbiology
سال: 1953
ISSN: 0003-6919
DOI: 10.1128/am.1.5.252-254.1953